Revisiting the DBM-Tree

نویسندگان

  • Marcos R. Vieira
  • Fabio Jun Takada Chino
  • Agma J. M. Traina
  • Caetano Traina
چکیده

In [Vieira et al. 2004] we presented a new dynamic Metric Access Method (MAM) called DBM-tree. This structure, unlike any other MAM, explores the varying density of elements in the dataset that allows creating, in a controlled way, unbalanced trees. Every dynamic MAM that works with persistent data proposed so far uses the same principle employed in conventional trees, like the B-tree [Comer 1979]. This principle is to maintain the height of the tree as minimal as possible, and it is widely applied for data domains for which the total ordering property holds. Since the total number of disk operations required to retrieve a register is direct correlated with the height of the tree, one way to perform a search with minimum number of disk accesses is to keep the structure height-balanced.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

DBM-Tree: A Dynamic Metric Access Method Sensitive to Local Density Data

Metric Access Methods (MAM) are employed to accelerate the processing of similarity queries, such as the range and the k-nearest neighbor queries. Current methods improve the query performance minimizing the number of disk accesses, keeping a constant height of the structures stored on disks (height-balanced trees). The Slim-tree and the M-tree are the most efficient dynamic MAM so far. However...

متن کامل

تأثیر ماتریکس استخوان دمینرالیزه‌ گاو بر ترمیم نقایص استخوان پاریتال خرگوش

Background and Aims: The present study was designed for evaluation of bovine demineralized bone matrix (DBM) in healing process of bone defects and comparison of bovine DBM (xenograft) and human DBM (allograft) which is used clinically. Materials and Methods: Seven male white New Zealand rabbits were used in this study. The incision was made directly over the midsagital suture of the parietal b...

متن کامل

Revisiting R-Tree Construction Principles

Spatial indexing is a well researched field that benefited computer science with many outstanding results. Our effort in this paper can be seen as revisiting some outstanding contributions to spatial indexing, questioning some paradigms, and designing an access method with globally improved performance characteristics. In particular, we argue that dynamic R-tree construction is a typical cluste...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • JIDM

دوره 1  شماره 

صفحات  -

تاریخ انتشار 2010